protocol analysis
AFAFed -- Protocol analysis
In this paper, we design, analyze the convergence properties and address the implementation aspects of AFAFed. This is a novel Asynchronous Fair Adaptive Federated learning framework for stream-oriented IoT application environments, which are featured by time-varying operating conditions, heterogeneous resource-limited devices (i.e., coworkers), non-i.i.d. local training data and unreliable communication links. The key new of AFAFed is the synergic co-design of: (i) two sets of adaptively tuned tolerance thresholds and fairness coefficients at the coworkers and central server, respectively; and, (ii) a distributed adaptive mechanism, which allows each coworker to adaptively tune own communication rate. The convergence properties of AFAFed under (possibly) non-convex loss functions is guaranteed by a set of new analytical bounds, which formally unveil the impact on the resulting AFAFed convergence rate of a number of Federated Learning (FL) parameters, like, first and second moments of the per-coworker number of consecutive model updates, data skewness, communication packet-loss probability, and maximum/minimum values of the (adaptively tuned) mixing coefficient used for model aggregation.
Towards Human-Like Automated Test Generation: Perspectives from Cognition and Problem Solving
Automated testing tools typically create test cases that are different from what human testers create. This often makes the tools less effective, the created tests harder to understand, and thus results in tools providing less support to human testers. Here, we propose a framework based on cognitive science and, in particular, an analysis of approaches to problem-solving, for identifying cognitive processes of testers. The framework helps map test design steps and criteria used in human test activities and thus to better understand how effective human testers perform their tasks. Ultimately, our goal is to be able to mimic how humans create test cases and thus to design more human-like automated test generation systems. We posit that such systems can better augment and support testers in a way that is meaningful to them.
507
Don was one of the pioneers of our field, whose early research built the foundation for the area that would later come to be labeled "knowledge based systems" (and still later "expert systems"). Don received a B.S. in Electrical Engineering from Iowa State University in 1958, and an M.S. in Electrical Engineering from the University of California, Berkeley in 1964. He then entered the Ph.D. program at Stanford's newly created Cotiputer Science Department. While at Berkeley he met a young professor named Ed Feigenbaum, and when Feigenbaum moved to Stanford in 1965 Don became Ed's first Ph.D. student. Ed recalls: "In mid-1965 the DENDRAL project began in earnest, and Don was its first (and at the time its only) Ph.D. student.
Donald A. Waterman 1936-1987
Don was one of the pioneers the checkers player, and Waterman's. of our field, whose early research built the foundation for the "His subsequent contributions to protocol analysis, to area that would later come to be labeled "knowledge based the technology of rule-based systems, and to the literature of systems" (and still later "expert systems"). Don received a B.S. in Electrical Engineering from With Don's work on production systems in his thesis, it Iowa State University in 1958, and an M.S. in Electrical was only natural that he should move to Carnegie-Mellon to Engineering from the University of California, Berkeley in work with Allen Newell after acquiring his Ph.D. in 1968. He then entered the Ph.D. program at Stanford's Al takes up the story from there: newly created Cotiputer Science Department. While at "Don came to CMU in Psychology, rather than Computer Berkeley he met a young professor named Ed Feigenbaum, Science. As with many people in AI, he had an abiding and when Feigenbaum moved to Stanford in 1965 Don became interest in understanding human cognition, although it always Ed's first Ph.D. student.